Wireless network throughput enhancement through channel aware scheduling

ABSTRACT

A channel aware scheduler (CAS) is disclosed that takes advantage of changing wireless channel conditions in order to maximize aggregated system throughput. The CAS is aware of the different channel conditions for one or more stations and adjusts its scheduling of packet transmissions in light of the same. A related CAS algorithm may take advantage of that knowledge in order to increase aggregated system throughput while concurrently addressing other potential fairness constraints.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation and claims the priority benefit of U.S. patent application Ser. No. 14/028,323 filed Sep. 16, 2013, which is a continuation and claims the priority benefit of U.S. patent application Ser. No. 12/181,274 filed Jul. 28, 2008, now U.S. Pat. No. 8,547,899 issued on Oct. 1, 2013, which claims the priority benefit of U.S. provisional application number 60/952,557 filed Jul. 28, 2007, the disclosures of which are incorporated herein by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention generally relates to communications networks. More particular, the present invention related to systems and method for increased data throughput in communications networks.

2. Description of the Related Art

A wireless channel is generally understood as a pathway between two communication endpoints. Through a wireless channel, the communication of any number of forms of data may take place. The efficient and effective communication of data is, however, subject to any number of characteristics of a particular wireless channel.

For example, a wireless channel with low throughput would not be recommended for the communication of data related to a high-definition television program. Similarly, the use of a wireless channel with a large amount of available bandwidth may be better utilized in the context of time-sensitive data transfers (e.g., voice communications) rather than the exchange of low priority and low-bandwidth background data queries.

Characteristics of a wireless channel may vary over time. For example, a wireless channel that at one moment has available bandwidth may subsequently be subjected to bottlenecks and dropped data packets thus requiring retransmission of the same. These variances in network characteristics may be a result of, for example, terminal mobility, multipath fading, or interference.

With respect to terminal mobility, a terminal may (while in motion) access wireless services from different locations. The mobility of the terminal requires the network to expend resources related to identifying and locating that terminal. The accessing of the network at different locales over time in conjunction with the need of the network to identify and locate the terminal may affect the quality of a wireless signal in that network.

Multipath fading involves the phenomenon of multipath propagation whereby a radio signal arrives at a receiving station (e.g., an antenna), at different times, via two or more paths. Multipath propagation may be induced by the refracting and reflecting of a wireless signal by various objects in the wireless environment (e.g., walls and metal objects). As a result of multipath propagation, the wireless signal is distorted thereby resulting in a deteriorated communications experience, which may include jitter or ghosting in the case of audio or video content.

Interference, broadly stated, may be mobile or static. In the case of mobile interference, the reception of a signal by a first mobile device (e.g., a wireless terminal) may be impeded or degraded by the transmission of a signal by another mobile device. Static interference is representative of the superposition of white noise (i.e., static) and other disturbing influences on a wireless signal. These influences are inclusive of thermal noise, electronic noise from receiver input circuits, and radiated electromagnetic noise that might be picked up by a receiving station's antenna.

FIG. 1A illustrates how characteristics of a wireless channel may vary over time in light of the aforementioned terminal mobility, multipath fading, and interference. FIG. 1A illustrates a wireless channel 100 where signal quality 110 between an access point (AP) and station are illustrated as a function of time 120. As can be seen from FIG. 1A, signal quality 110 is less at T+1 than at T+2. The signal quality 110 for T+1 and T+2 is less than the signal quality 110 illustrated at T+3, which is nearly equivalent to that of the signal quality 110 exhibited at T+4. Signal quality 110 improves at T+5 while experiencing a significant decrease at T+6.

Further complicating the understanding of wireless channel characteristics (and the optimal use of those channels) is that channel conditions often lack correlation amongst one another in a network of stations. The lack of correlation may be a result of different distances from an AP to a particular station, distances from a station (or the AP) to a particular source of interference, the movement of a mobile terminal or station, as well as varying multipath fading effects. FIG. 1B is exemplary in this regard with respect to illustrating the signal quality 110 between the aforementioned AP and Station A (130) and the AP and Station B (140). As shown in FIG. 1B, there is no immediately recognizable correlation in signal quality vis-a-vis the AP and the differing stations (130/140).

One attempt at managing variances in wireless channel characteristics, especially as they pertain to different stations, has been through the use of a scheduler. Schedulers may be embodied in hardware and/or software components—the latter being executable from memory or a storage device by a corresponding processing device—with respect to providing scheduling policies, rules, procedure, or other criteria in making scheduling decisions. A scheduler may, in light of the aforementioned policies or criteria and a given set of packets, select particular packets for serial transmission over a particular wireless channel.

Different scheduling policies may be used in an attempt to ensure a communications network's ability to provide different quality of service (QOS) guarantees. Policies may include strict priority (SP) where a particular station queue is always allocated bandwidth and/or transmitted before other queues. An alternative policy includes round robin (RR) scheduling, which assigns bandwidth and transmits packets in equal portion, in order, and without priority to a particular station queue.

Weighted round robin (WRR), on the other hand, is a best-effort scheduling discipline (i.e., the network does not provide any guarantees that data is delivered or that a user is given a guaranteed QOS level or priority). Through WRR scheduling, station queues can be assigned a weight—an integer value that might indicate capacity or priority. Station queues with higher weights have their packets transmitted prior to those with lesser weights. All queues are eventually given regular transmission access to a channel albeit it those queues with higher weight will get more transmission access attempts than those with lesser weights.

Yet another scheduling policy is fair queuing (FQ), which allows several packet flows to fairly share link capacity. Fair queuing differs from first-in-first-out (FIFO) (i.e., what comes in first is handled first and what comes in next waits until the first is finished) in that an ill-behaved flow that consists of, for example, large data packets or a large number of packets will punish itself and not other packet flows. In FQ scheduling, in order to decide which packet should be forwarded first, the FQ algorithm estimates a virtual finishing time of all candidate packets (i.e., the packets at the head of all non-empty queues) based on, for example, the arrival time of the packet, the packet size, and the number of queues. The FQ scheduling algorithm or policy then compares the virtual finishing time and selects the minimum one. The packet with the minimum virtual finishing time is transmitted.

A still further scheduling policy is weighted fair queuing (WFQ), which allows different scheduling priorities to be statistically multiplexed. WFQ is a generalization of the aforementioned FQ algorithm where each data flow has a separate FIFO queue. Whereas the aforementioned ill-behaved queue will only punish itself, WFQ allows different sessions to have different service shares. If N data flows currently are active, with weights ω₁, ω₂ . . . ω_(N), data flow number i will achieve an average data rate of

$\frac{R\; \omega_{i}}{\left( {\omega_{1}{\omega_{2}{\ldots \omega_{N}}}} \right)}$

An end-to-end delay bound can be guaranteed in WFQ scheduling. By dynamically regulating WFQ weights, this policy can be used to control QOS and achieve a guaranteed data rate.

Typical wireless devices (e.g., an 802.11x compliant device) implement a simple class and/or priority scheduling mechanism with a FIFO queue per each traffic class. An example of such a mechanism 200 is illustrated in FIG. 2. The scheduling mechanism 200 of FIG. 2 illustrates four classes of traffic priority: voice (230), video (240), best-effort (250), and background (260). While the voice, video, best-effort, and background represent the typical four traffic priorities, the actual number of classes may vary in order to accommodate, for example, additional traffic classes and management traffic.

In the scheduling mechanism 200 of FIG. 2, packets are introduced to the wireless device via a network/input interface 210. It should be noted that certain hardware components (e.g. a processor or memory) are not illustrated in that one skilled in the art will appreciate and understand the requisite components to implement the various applications disclosed herein. Packets may be received from another wireless device, a network backbone, a router, or a primary source of content that has been converted into data packets for transmission.

Packets are then routed to the classifier 220. The classifier 220 may identify packets based on application layer data regardless of port. The classifier 220 may alternatively identify packets based on Internet Protocol (IP) address, port numbers, and so on. Packet classification based on multiple fields may be implemented using basic search algorithms, geometric algorithms, heuristic algorithms, or hardware-specific search algorithms. A variety of methodologies for packet classification are generally known in the art.

Once classified by classifier 220, packets are then routed to an appropriate queue: voice, video, best-effort, background (230-260). The priority scheduler 270 then schedules the classified and queued packets. In the priority based queuing and scheduling mechanism 200 of FIG. 2, all packet traffic of a specific class (e.g., voice (230) is subjected to FIFO queuing. Scheduling is done strictly by priority (SP). As such, priority N (e.g., voice (230)) must be empty before priority N+1 (e.g., video (240)) is allowed to transmit. Packets are then transmitted or further routed via the appropriate network/output interface 280.

Problems exist with respect to prior art scheduling methodologies based on priority queuing with per class FIFO. Channel aware scheduling (as discussed in further detail below) may not be implemented in this context. For example, traffic to different stations is interleaved within each FIFO queue. Further, only one packet is available at any given time—the packet at the head of the highest priority queue.

Typical prior art scheduler implementations also blindly retransmit the head end packet from the highest priority active queue until that packet is either successfully acknowledged by the recipient or some maximum number of retransmissions occurs. This blind retransmission causes head-of-line blocking. As a result, poor system performance results and, in many circumstances, clients may become completely impaired.

SUMMARY OF THE PRESENTLY CLAIMED INVENTION

An embodiment of the presently claimed invention includes a system for increasing wireless network throughput. The system includes a classifier configured to assign a packet to one of a plurality of transmission queues. The system further includes a first scheduling module and a second scheduling module. The first scheduling module is stored in a computer-readable medium and executable by a processing device to select an assigned packet for transmission from one of the plurality of transmission queues in accordance with a strict priority schedule. The second scheduling module is likewise stored in a computer-readable medium and executable to select a priority scheduled packet for transmission, wherein the selection is made in accordance with a weighted scheduling technique.

In a second embodiment of the presently claimed invention, a method for increasing wireless throughput is disclosed. The method includes the steps of assigning a packet to one of a plurality of transmission queues; selecting an assigned packet for transmission from one of the plurality of transmission queues in accordance with a priority schedule; selecting a priority scheduled packet for transmission in accordance with a weighted scheduling technique; and transmitting the packet.

A third embodiment is for a computer-readable storage medium having embodied thereon a program. The program is executable by a processing device to perform a method for increasing wireless throughput, the method includes the steps of assigning a packet to one of a plurality of transmission queues; selecting an assigned packet for transmission from one of the plurality of transmission queues in accordance with a priority schedule; selecting a priority scheduled packet for transmission in accordance with a weighted scheduling technique; and transmitting the packet.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A illustrates a wireless channel where signal quality between an access point and station are sown as a function of time.

FIG. 1B illustrates signal quality between an access point and two stations.

FIG. 2 illustrates a class/priority scheduling mechanism with a FIFO queue for each traffic class.

FIG. 3 illustrates the biasing of a scheduler in a channel aware scheduler network environment involving an AP and two stations.

FIG. 4 illustrates an embodiment of a channel aware scheduling mechanism utilizing hierarchical schedulers.

FIG. 5 illustrates a method for channel aware scheduling transmission including a channel aware scheduler mechanism utilizing a deferred retransmission module.

FIG. 6 illustrates queue weighting as may occur in the context of the channel aware scheduler mechanism of FIG. 4 and the corresponding method of FIG. 5.

DETAILED DESCRIPTION

The presently disclosed invention utilizes channel aware scheduling. Through channel aware scheduling, an optimized scheduler—a channel aware scheduler (CAS)—takes advantage of changing wireless channel conditions in order to maximize aggregated system throughput. A CAS is aware of the different channel conditions for one or more stations and adjusts its scheduling of packet transmissions in light of the same. The CAS algorithm may take advantage of that knowledge in order to increase aggregated system throughput while concurrently addressing other potential fairness constraints.

FIG. 3 illustrates an example of how a CAS may be beneficial in a network environment 300 involving an AP and two stations (A and B). Based on the particular signal quality for each station (A or B) over time (T=0, T+1, T+N), the scheduler is biased toward one station or the other (i.e., the scheduler is aware of the quality of both channels). For example, at time T+1, +2 and, +3, the scheduler is biased toward station B while at time T+4 and T+5, the scheduler is biased to station A.

The CAS mechanism of the present invention allows for finer queuing and scheduling granularity with respect to individual stations and packet flows. An embodiment of the present invention utilizes hierarchical scheduling. In a first level of the hierarchy, an SP scheduling algorithm may be employed as is common to enterprise and service-provider class networking equipment. In a second level, the CAS mechanism may utilize WRR or WFQ scheduling algorithms as described above.

FIG. 4 illustrates an embodiment of a CAS mechanism 400 utilizing the aforementioned hierarchical schedulers. Packets are received at classifier 410 following initial receipt by a network/input interface. Classifier 410 may operate in a manner similar to classifier 220 as illustrated in FIG. 2.

Following classification of an incoming packet at a wireless device implementing the CAS mechanism 400 of FIG. 4, the packet is routed to a first part of the scheduling hierarchy (i.e., a second level scheduler). In FIG. 4, this first portion of the scheduling hierarchy is represented by a queue with an associated priority. The CAS mechanism 400 of FIG. 4 illustrates three priority queues, which may be representative of voice, video, and background (420-440, respectively). Differing numbers of priority queues may be implemented subject to the particular type of packet flows being received at the CAS mechanism 400. For example, if the wireless device implementing CAS mechanism 400 is dedicated to the delivery of Internet Packet Television (IPTV) content, the voice queue (420) may be omitted.

Corresponding to each priority queue (420-440) in FIG. 4 is one or more station queues (420A-420C; 430A-430C; and 440A-440C). Each of the station queues 420A-420C; 430A-430C; and 440A-440C operates in conjunction with a WRR mechanism (450-470). Utilizing an associated WRR mechanism, each station queue 420A-420C; 430A-430C; and 440A-440C is assigned a weight indicative of capacity or priority. Station queues 420A-420C; 430A-430C; and 440A-440C with higher weights will have their packets transmitted prior to those with lesser weights. Weighting of a station queue is discussed in greater detail with respect to FIG. 6 below.

Following assignment to a priority and weighted station queue in the first portion of the hierarchy, the priority scheduler 480 of the second portion of the hierarchy (i.e., the first level scheduler) assumes responsibility for scheduling the transmission of the classified, prioritized, weighted, and queued packets. The priority scheduler 480 of FIG. 4 may operate in a fashion similar to that of the priority scheduler 270 in FIG. 2. Packets are then transmitted or further routed via an appropriate network/output interface.

In some embodiments, the CAS mechanism 400 of FIG. 4 may utilize additional scheduling techniques such as deferred retransmission and weighted feedback. Both of these techniques may be implemented in the context of the second level schedulers of FIG. 4.

In the case of deferred retransmission, an indication of a failed transmission may be used to temporarily defer transmission or retransmission to the failed station and instead service other active stations in a priority queue. A deferred retransmission module may make direct use of a standard retransmission request mechanism such as an 802.11 acknowledgment (ACK) that would indicates a retransmission is required when no ACK is received.

Alternatively, an Automated Repeat Request (ARQ), which uses acknowledgments and timeouts to achieve reliable data transmission, may be used. A Hybrid Automated Repeat Request (HARQ) may also be used. In standard ARQ, error-detection information (ED) bits are added to data to be transmitted, such as cyclic redundancy check (CRC). In HARQ, forward error correction (FEC) bits are also added to the existing ED bits, such as Reed-Solomon code or Turbo code. As a result HARQ performs better than ordinary ARQ in poor signal conditions but may adversely affect the environment in good signal conditions. HARQ may have particular applicability to the IEEE 802.16-2005 standard for mobile broadband wireless access, also known as ‘mobile WiMAX.’ HARQ mechanisms also tend to be implemented in hardware.

The absence of an ACK or the receipt of an ARQ or HARQ (i.e., a retransmission request) operates as an indication of packet corruption. Packet corruption, in turn, is an indication of potential channel fade or other adverse channel condition. Upon indication of a retransmission requirement, the second level scheduler mechanism may elect to defer retransmission and move on to the next queue station that has pending packets.

FIG. 5 illustrates a method for CAS transmission in accordance with the CAS mechanism 400 of FIG. 4 as well as a CAS mechanism utilizing a deferred retransmission module.

In step 510, a packet is received. Receipt of the packet may occur via a network/input interface. Packets may be received from another wireless device, a network backbone, a router, or a primary source of content that has been converted into data packets for transmission.

In step 520, received packets are classified. The packets may be classified based on an application layer data regardless of port. Packets may also be identified and subsequently classified based on IP address, port numbers, and so on. Packet classification based on multiple fields may be implemented using basic search algorithms, geometric algorithms, heuristic algorithms, or hardware-specific search algorithms.

In step 530, packets are routed to an appropriate priority queue. Packets are then assigned to a station queue in step 540. Weighting of the station queues takes place in step 550. It should be noted that station queue weighting may be dynamic or static and may take place prior to or concurrent with the transmission of any particular packet or packet flow. Weighting of a station queue is discussed further with respect to FIG. 6. Packets are scheduled solely based on priority in 560 and transmitted in accordance with that priority in step 570.

In an alternative embodiment of a CAS mechanism that utilizes a deferred retransmission module, a retransmission request is received at optional step 580. In response to the retransmission request, a particular station queue is deferred in optional step 590. Scheduling of the remaining priority and channel queues takes place in step 560 as would occur in an embodiment not utilizing a deferred retransmission module. Transmission of the scheduled packets takes place in step 570.

FIG. 6 illustrates queue weighting as may occur in the context of the CAS mechanism of FIG. 4 and the corresponding method of FIG. 5. Using a WRR algorithm, a weight (640-660) is determined for each queue (610-630). The WRR scheduler 670 (e.g., WRR 450) then round robins between active queues (those that have pending packets) and transmits up to N packets from a queue where N is the weight associated with that queue.

Weighting may be implemented via credit register 690 that is loaded with a particular weight when a new station queue 680 is selected. The credit register 680 is decremented with each transmission from that station queue 680. When the credit register 690 reaches 0, the WRR scheduler 670 advances in a round robin fashion to the next queue with an associated load of credits.

An embodiment of the CAS mechanism utilizing a deferred retransmission module may modify the WRR scheduler 670 as follows. Upon receipt of a retransmission requirement, it is determined from which station queue the failed packet originated. The failed packet is then re-queued at the head of that queue. If that particular queue is still active (i.e., the queue still has credits), the queue is penalized through the additional decrement of the credit register or decrementing the credit register to zero thereby forcing an activation of a queue associated with a different station. These penalization activities may take place in the context of optional step 590 of FIG. 5.

A further embodiment of the CAS mechanism disclosed herein may implement weighted feedback, which may be applicable to a hierarchical implementation utilizing WFQ or WRR. In such an embodiment, per-station channel conditions are estimated. These estimates may utilize low-level metrics such as signal-to-noise ratio (SNR) or error-to-vector magnitude (EVM). Application level metrics such as estimated throughput may also be utilized. Queue weights are modified to reflect channel conditions such that the scheduler favors stations with the better channel. Generally, weights are proportional to each channel capacity in order to maximize throughput. Weights may be limited to some minimal value to prevent the starvation of poor stations.

A still further embodiment of weight feedback involves, for each associated station, the performance of throughput estimation. Estimation may occur using a throughput model and packet encoding rule (PER) statistics. Packet transmission time stamps may also be used. If the estimated throughput is below some minimum threshold, the estimated throughput is set to the minimum threshold in order to ensure that some minimal bandwidth allocation is made with respect to each station. The WRR or WFQ weight is scaled proportionally to the estimated throughput.

Computer-executable instructions and associated data structures represent examples of the programming means for executing steps of the methods and implementing particular system configurations disclosed herein. Such methodologies may be stored in a computer-readable storage medium. Such methodologies may be executed in the context of a corresponding processing device.

While the present invention has been described in the context of a series of exemplary embodiments, these descriptions are not intended to limit the scope of the invention to the particular forms set forth herein. To the contrary, the present description is intended to cover such alternatives, modifications, and equivalents as may be included within the spirit and scope of the invention as defined by the appended claims and otherwise appreciated by one of ordinary skill in the art. 

1. (canceled)
 2. A system for increasing wireless network throughput, the system comprising: a classifier configured to receive a data packet and assign the packet to one of a plurality of priority transmission queues, wherein each of the plurality of the priority transmission queues includes an associated packet priority level for data transmission and one or more station queues, wherein each station queue is assigned a weight indicative of a transmission channel capacity or a transmission channel priority, and wherein a data packet in a station queue with a higher weight is transmitted before a data packet in a station queue with a lower weight; and a hierarchical scheduling module stored in a computer-readable storage medium and executable by a processing device, wherein the hierarchical scheduling module: selects a first scheduled data packet for transmission from a first priority transmission queue, based on the associated packet priority levels of the plurality of priority transmission queues and the weights of the one or more station queues, transmits the first scheduled data packet over a selected transmission channel, determines whether the transmitted first scheduled data packet has failed to reach its destination, and when the transmitted first scheduled data packet has failed to reach its destination, defers the retransmission of the first scheduled data packet and transmits a second scheduled data packet from another station queue of the first priority transmission queue.
 3. The system of claim 2, wherein the selection of scheduled data packets is made utilizing weighted round robin for each station queue.
 4. The system of claim 2, wherein the selection of scheduled data packets is made utilizing weighted fair queueing for each station queue.
 5. The system of claim 2, wherein the hierarchical scheduling module further re-queues the first scheduled data packet for re-transmission at the station queue from which the first scheduled data packet was originated from.
 6. The system of claim 5, wherein the failed packet is re-queued at a head of the station queue from which the first scheduled data packet was originated.
 7. The system of claim 2, wherein the assigned weights are modified based on one or more current channel conditions associated with each priority transmission queue.
 8. The system of claim 7, wherein the modification to each of the assigned weights is proportional to an associated channel capacity.
 9. The system of claim 7, wherein the modification is limited to a predetermined minimal value.
 10. The system of claim 7, wherein the modification to each of the queue weights is proportional to an estimation of throughput performance.
 11. The system of claim 10, wherein the estimation of throughput performance is based on at least one of a throughput model, packet encoding rule, and packet transmission time.
 12. A method for increasing wireless network throughput, the method comprising: receiving a data packet; assigning the packet to one of a plurality of priority transmission queues, wherein each of the plurality of the priority transmission queues includes an associated packet priority level for data transmission and one or more station queues, wherein each station queue is assigned a weight indicative of a transmission channel capacity or a transmission channel priority, and wherein a data packet in a station queue with a higher weight is transmitted before a data packet in a station queue with a lower weight; selecting a first scheduled data packet for transmission from a first priority transmission queue, based on the associated packet priority levels of the plurality of priority transmission queues and the weights of the one or more station queues; transmitting the first scheduled data packet over a selected transmission channel; determining whether the transmitted first scheduled data packet has failed to reach its destination; and when the transmitted first scheduled data packet has failed to reach its destination, deferring the retransmission of the first scheduled data packet and transmitting a second scheduled data packet from another station queue of the first priority transmission queue.
 13. The method of claim 12, wherein said selecting the scheduled data packets is made utilizing weighted round robin for each station queue.
 14. The method of claim 12, wherein said selecting the scheduled data packets is made utilizing weighted fair queueing for each station queue.
 15. The method of claim 12, further comprising re-queuing the first scheduled data packet for re-transmission at the station queue from which the first scheduled data packet was originated from.
 16. The method of claim 15, wherein the failed packet is re-queued at a head of the station queue from which the first scheduled data packet was originated.
 17. The method of claim 12, wherein the assigned weights are modified based on one or more current channel conditions associated with each priority transmission queue.
 18. The method of claim 17, wherein the modification to each of the assigned weights is proportional to an associated channel capacity.
 19. The method of claim 17, wherein the modification is limited to a predetermined minimal value.
 20. The method of claim 17, wherein the modification to each of the queue weights is proportional to an estimation of throughput performance.
 21. The method of claim 20, wherein the estimation of throughput performance is based on at least one of a throughput model, packet encoding rule, and packet transmission time. 